Density of Monochromatic Infinite Subgraphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Highly connected monochromatic subgraphs

We conjecture that for n> 4(k−1) every 2-coloring of the edges of the complete graphKn contains a k-connectedmonochromatic subgraph with at least n − 2(k − 1) vertices. This conjecture, if true, is best possible. Here we prove it for k = 2, and show how to reduce it to the case n< 7k − 6. We prove the following result as well: for n> 16k every 2-colored Kn contains a k-connected monochromatic s...

متن کامل

Highly connected monochromatic subgraphs of multicolored graphs

We consider the following question of Bollobás: given an r-colouring of E(Kn), how large a k-connected subgraph can we find using at most s colours? We provide a partial solution to this problem when s = 1 (and n is not too small), showing that when r = 2 the answer is n−2k+2, when r = 3 the answer is ⌊n−k 2 ⌋+1 or ⌈n−k 2 ⌉ + 1, and when r − 1 is a prime power then the answer lies between n r−1...

متن کامل

Monochromatic subgraphs of 2-edge-colored graphs

Lehel conjectured that for all n, any 2-edge-coloring of Kn admits a partition of the vertex set into a red cycle and a blue cycle. This conjecture led to a significant amount of work on related questions and was eventually proven for all n by Bessy and Thomassé. Balogh, Barát, Gerbner, Gyárfás, and Sárközy conjectured a stronger statement for large n: that if δ(G) > 3n/4, then any 2-edge-color...

متن کامل

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs

Given graphs G and H, a vertex coloring c : V (G) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ(H,G), is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G, Σ(H,G), is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for ...

متن کامل

Planar graph coloring avoiding monochromatic subgraphs: trees

We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2019

ISSN: 0209-9683,1439-6912

DOI: 10.1007/s00493-018-3724-2